Tolerances in Geometric Constraint Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tolerances in Geometric Constraint Problems

We study error propagation through implicit geometric problems by linearizing and estimating the linearization error. The method is particularly useful for quadratic constraints, which turns out to be no big restriction for many geometric problems in applications.

متن کامل

Tree-decomposable and Underconstrained Geometric Constraint Problems

A geometric constraint problem, also known as a geometric constraint system, consists of a finite set of geometric objects, such as points, lines, circles, planes, spheres, etc., and constraints upon them, such as incidence, distance, tangency, and so on. A solution of a geometric constraint problem P is a coordinate assignment for each of the geometric objects of P that places them in relation...

متن کامل

Geometric Constraint Problems and Solution Instances

Geometric constraint solving is a growing field devoted to solve geometric problems defined by relationships, called constraints, established between the geometric elements. In this work we show that what characterizes a geometric constraint problem is the set of geometric elements on which the problem is defined. If the problem is wellconstrained, a given solution instance to the geometric con...

متن کامل

Geometric Formulation of Orientation Tolerances

The rapid proliferation of coordinate measuring machines (CMMs) triggered the need for precise and rigorous formulations of each tolerance concept. In this paper, we employ the concept of con guration space of symmetric features to de ne each type of datum features and orientation tolerances. The establishment of datum features and orientation tolerances are formulated in an linear programming ...

متن کامل

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms

We systematically design two new decomposition–recombination (DR) planners, geared to perform well with respect to several performance measures. The DR-planning problem and the performance measures were formally defined in Part I of this paper to closely reflect specific requirements of CAD/CAM applications. As expected, in analysis and comparison based on all of these performance measures, one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Reliable Computing

سال: 2005

ISSN: 1385-3139,1573-1340

DOI: 10.1007/s11155-005-3617-0